1411B - Fair Numbers - CodeForces Solution


brute force number theory *1000

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
       long long n;
       cin>>n;
       while(true)
       {
           string s=to_string(n);
           bool flag=false;
           for(int i=0;i<s.size();i++)
           {
               long long d=s[i]-'0';
               if(d!=0 && n%d!=0)
               {
                   flag=true;
                   break;
               }
           }
           if(flag==true)
           {
               n++;
           }
           else
           {
               cout<<n<<endl;
               break;
           }
       }
    }
}




Comments

Submit
0 Comments
More Questions

544B - Sea and Islands
152B - Steps
1174D - Ehab and the Expected XOR Problem
1511A - Review Site
1316A - Grade Allocation
838A - Binary Blocks
1515D - Phoenix and Socks
1624D - Palindromes Coloring
1552F - Telepanting
1692G - 2Sort
1191A - Tokitsukaze and Enhancement
903A - Hungry Student Problem
52B - Right Triangles
1712A - Wonderful Permutation
1712D - Empty Graph
1712B - Woeful Permutation
1712C - Sort Zero
1028B - Unnatural Conditions
735B - Urbanization
746C - Tram
1278B - A and B
1353D - Constructing the Array
1269C - Long Beautiful Integer
1076A - Minimizing the String
913C - Party Lemonade
1313A - Fast Food Restaurant
681A - A Good Contest
1585F - Non-equal Neighbours
747A - Display Size
285A - Slightly Decreasing Permutations